-
1 nonadjacent set
Большой англо-русский и русско-английский словарь > nonadjacent set
-
2 nonadjacent set
Математика: несмежное множество -
3 nonadjacent set
мат. -
4 set
1) набор; комплект- semiconductor assembly set - set of Belleville springs - set of conventional set - set of drawing instruments - set of gate patterns - set of gauge blocks - set of logical elements - set of statistical data - set of technical aids- snap set2) партия3) совокупность; множество4) установка; агрегат- desk telephone set - dial telephone set- gear set- local-battery telephone set - man-pack radio set - multi-operator welding set - sound-powered telephone set - wall telephone set5) регулировка; настройка || регулировать; настраивать6) группа; ансамбль7) класс; семейство9) схватывание || схватываться10) затвердевание || затвердевать11) крепление || закреплять12) геол. свита пород13) осадка (грунта) || оседать ( о грунте)14) радиоточка15) спорт сет16) включать, приводить в действие17) мат. множествоset closed under operation — множество, замкнутое относительно операции
- absolutely compact set - absolutely continuous set - absolutely convex set - absolutely irreducible set - absolutely measurable set - affinely independent set - affinely invariant set - algebraically independent set - almost finite set - almost full set - angular cluster set - asymptotically indecomposable set - at most denumerable set - centro-symmetric set - completely bounded set - completely continuous set - completely generating set - completely improper set - completely irreducible set - completely nonatomic set - completely normal set - completely ordered set - completely productive set - completely reducible set - completely separable set - constructively nonrecursive set - convexly independent set - countably infinite setto set aside — не учитывать, не принимать во внимание; откладывать
- cut set- cyclically ordered set - deductively inconsistent set - derived set - doubly well-ordered set - dual set of equations - dynamically disconnected set - effectively enumerable set - effectively generating set - effectively nonrecursive set - effectively simple set - enumeration reducible set - finely perfect set - finitely definite set - finitely measurable set- flat set- full set- fully reducible set - functionally closed set - functionally complete set - functionally open set - fundamental probability set - generalized almost periodic set- goal set- internally stable set- knot set- left directed set - left normal set - left-hand cluster set - linearly ordered set - local peak set - locally arcwise set - locally closed set - locally compact set - locally connected set - locally contractible set - locally convex set - locally finite set - locally invariant set - locally negligible set - locally null set - locally polar set - locally polyhedral set - metrically bounded set - metrically dense set - multiply ordered set - nearly analytic set - nearly closed set - nonvoid set - normally ordered set- null set- open in rays set - partitioned data set- peak set- pole set- positively homothetic set- pure set- radially open set - rationally independent set - recursively creative set - recursively indecomposable set - recursively isomorphic set - recursively productive set - regularly convex set - regularly situated sets - relatively closed set - relatively compact set - relatively dense set - relatively interpretable set - relatively open set - right normal set - right-hand cluster set- scar set- sequentially complete set - serially ordered set - set of elementary events - set of first category - set of first kind - set of first species - set of possible outcomes - set of probability null - set of second category - set of second species - shift invariant set - simply connected set - simply ordered set - simply transitive set- skew set- star set- strongly bounded set - strongly closed set - strongly compact set - strongly connected set - strongly convex set - strongly dependent set - strongly disjoint sets - strongly enumerable set - strongly independent set - strongly minimal set - strongly polar set - strongly reducible set - strongly separated set - strongly simple set - strongly stratified set- tame set- tautologically complete set - tautologically consistent set - tautologically inconsistent set- test set- thin set- tie set- time set- totally disconnected set - totally imperfect set - totally ordered set - totally primitive set - totally unimodular set - totally unordered set - truth-table reducible set - uniformly bounded set - uniformly continuous set - uniformly convergent set - uniformly integrable set - uniformly universal set - unilaterally connected set- unit set- vacuous set- void set- weakly compact set - weakly convex set - weakly n-dimensional set - weakly stratified set - weakly wandering set - well chained set - well founded set - well measurable set - well ordering set - well quasiordered set -
5 несмежное множество
nonadjacent set мат.Русско-английский научно-технический словарь Масловского > несмежное множество
-
6 несмежное множество
Большой англо-русский и русско-английский словарь > несмежное множество
-
7 несмежное множество
Mathematics: nonadjacent setУниверсальный русско-английский словарь > несмежное множество
См. также в других словарях:
combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… … Universalium
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Rook's graph — infobox graph name = Rook s graph image caption = 8x8 Rook s graph vertices = nm edges = nm ( n + m )/2 nm diameter = 2 chromatic number = max( n , m ) chromatic index = girth = 3 (if max( n , m ) ≥ 3) properties = regular, vertex transitive,… … Wikipedia
Two-graph — In mathematics, a two graph is a set of (unordered) triples chosen from a finite vertex set X , such that every (unordered) quadruple from X contains an even number of triples of the two graph. A regular two graph has the property that every pair … Wikipedia
Induced path — An induced path of length four in a cube. Finding the longest induced path in a hypercube is known as the snake in the box problem. In the mathematical area of graph theory, an induced path in an undirected graph G is a path that is an induced… … Wikipedia
Ottawa dialect — Ottawa Nishnaabemwin, Daawaamwin Spoken in Canada, United States Region Ontario, Michigan, Oklahoma Ethnicity Ottawa people … Wikipedia
Rado graph — The Rado graph, as numbered by Rado (1964). In the mathematical field of graph theory, the Rado graph, also known as the random graph or the Erdős–Renyi graph, is the unique (up to isomorphism) countable graph R such that for any finite graph G… … Wikipedia
Ojibwe language — Anishinaabemowin, ᐊᓂᔑᓈᐯᒧᐎᓐ Pronunciation [anɪʃɪnaːpeːmowɪn] Spoken in … Wikipedia
Root system — This article discusses root systems in mathematics. For root systems of plants, see root. Lie groups … Wikipedia
Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and … Wikipedia
chess — chess1 /ches/, n. a game played by two persons, each with 16 pieces, on a chessboard. [1150 1200; ME < OF esches, pl. of eschec CHECK1] chess2 /ches/, n., pl. chess, chesses. one of the planks forming the roadway of a floating bridge. [1425 75;… … Universalium